Cs 229 Final Project Reduced Rank Regression

نویسنده

  • Wai Tsang
چکیده

where A is an unknown p× n matrix of coefficients and E is an unobserved m× n random noise matrix with independent mean zero and variance σ. We want to find an estimate  such that ||Y −XÂ|| is small. If we use standard least square estimation directly to estimate A in (1.1) without adding any constraints, then it is just the same as regressing each response on the predictors separately. In this way, we actually ignore the possibility that the responses may be correlated among themselves. Besides, when there are many attributes (p is large) and many different kinds of responses (n is large), the number of unknowns can be larger than the sample size m. We may then need much more effort to collect more samples to increase m or the least square method simply cannot be applied. To address this problem, one popular way to handle it is reduced rank regression. Let r(M) be the rank of a matrix M . If we expect r(A) = r < min (p, n) or A can be well approximated by a low rank matrix, we can write A as a product of two matrices with rank r, see [1]. That is A = BrCr, Br ∈ Rp×r and Cr ∈ Rr×n which have total r× (n+ p) unknowns needed to be estimated. It can be much less than m if r(A) is very small. The model (1.1) then become

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CS 229 = = Final Project Report SPEECH & NOISE SEPARATION

In this course project I investigated machine learning approaches on separating speech signals from background noise. Keywords—MFCC, SVM, noise separation, source separation, spectrogram

متن کامل

A Computational Model for Multi - Instrument Music Transcription CS 229 Final Project Report , Autumn 2013

The aim of our project is to build a model for multi-instrument music transcription. Automatic music transcription is the process of converting an audio wave file into some form of music notes representations. We propose a two-step process for an automatic multiinstrument music transcription system including timbre classification and source separation using probabilistic latent component analysis.

متن کامل

CS 229 Final Project Report Learning to Decode Cognitive States of Rat using Functional Magnetic Resonance Imaging Time Series

Recent fMRI studies have observed that the functional connectivity between different brain regions may exhibit significant dynamic changes when people are at rest [1]. Despite the little-known nature of the temporal dynamics at rest, it’s still possible for us to localize those ‘dynamic sources’ by comparing the fMRI time series at ‘rest-state’ to ‘anesthetized-state’, a mental state characteri...

متن کامل

CS 229 Project Report: San Francisco Crime Classification

Different machine learning approaches were conceptualized and implemented for predicting the probabilities of crime categories for crimes reported in San Francisco. The crimes records used in the research are downloaded from a competition on Kaggle. A Bayesian model, a mixture of Guassians model (stratified and unstratified), and logistic regression are implemented. A satisfactory result was ac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011